Optimal Content Placement For En-Route Web Caching1

نویسندگان

  • Anxiao Jiang
  • Jehoshua Bruck
چکیده

This paper studies the optimal placement of web files for en-route web caching. It is shown that existing placement policies are all solving restricted partial problems of the file placement problem, and therefore give only sub-optimal solutions. A dynamic programming algorithm of low complexity which computes the optimal solution is presented. It is shown both analytically and experimentally that the file-placement solution output by our algorithm outperforms existing enroute caching policies. The optimal placement of web files can be implemented with a reasonable level of cache coordination and management overhead for en-route caching; and importantly, it can be achieved with or without using data prefetching. This work was supported in part by the Lee Center for Advanced Networking at the California Institute of Technology.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Content Placement for En-Route Web Caching

This paper studies the optimal placement of web files for en-route web caching. It is shown that existing placement policies are all solving restricted partial problems of the file placement problem, and therefore give only sub-optimal solutions. A dynamic programming algorithm of low complexity which computes the optimal solution is presented. It is shown both analytically and experimentally t...

متن کامل

Optimal Methods for Object Placement in En-Route Web Caching for Tree Networks and Autonomous Systems

This paper addresses the problem of computing the locations of copies of an object to be placed among the en-route caches such that the overall cost gain is maximized for tree networks. This problem is formulated as an optimization problem and both unconstrained and constrained cases are considered. The constrained case includes constraints on the cost gain per node and on the number of copies ...

متن کامل

CRRP: Cost-Based Replacement with Random Placement for En-Route Caching

Caching is considered widely as an efficient way to reduce access latency and network bandwidth consumption. En-route caching, where caches are associated with routing nodes in the network, is proposed in the context of Web cache to exploit fully the potential of caching. To make sensible replacement and placement decision for en-route caching, traditional caching schemes either engage computat...

متن کامل

En-Route Web Caching in Trustworthy Structured Peer-To-Peer Networks

In the Peer-to-Peer networks Web caching plays an important role in reducing the network delays, latency of the user response and the server load. Still web caching is of great challenge as the maintenance of object copies at multiple nodes is the issue of trustworthiness, consistency and optimal resource placement. The en-route web caching strategy along with the reputation aggregation method ...

متن کامل

Improve Replica Placement in Content Distribution Networks with Hybrid Technique

The increased using of the Internet and its accelerated growth leads to reduced network bandwidth and the capacity of servers; therefore, the quality of Internet services is unacceptable for users while the efficient and effective delivery of content on the web has an important role to play in improving performance. Content distribution networks were introduced to address this issue. Replicatin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003